To reduce the calculation complexity of the Joint Probabilistic Data Association (JPDA) joint-association events, due to multiple targets' tracks aggregation, an improved JPDA algorithm, clustering by Meanshift algorithm and optimizing confirmation matrix by Bhattacharya coefficients,was proposed.The clustering center was created by Meanshift algorithm. Then the tracking gate was obtained by calculating Mahalanobis distance between the clustering center and targets' prediction observation. The Bhattacharya likelihood matrix which was as a basis for low probability events was created, consequently the computing complexity of JPDA joint-association events which was related to low probability events was reduced. The experimental results show that the new method is superior to the conventional JPDA both in computational complexity and precision of estimation for multiple targets' tracks aggregation.